Evaluation of a Semi-Automated Theorem Prover (Part I)

نویسنده

  • Helen Lowe
چکیده

So little evaluation has been carried out on user interfaces to theorem provers that even the question of what should be evaluated appears open. We took a user/task related approach, where subjects in a pilot study were given three theorems to prove, which might or might not require intervention by the user, and logged some of their interactions. In this paper, we describe the facets of semi-automated theorem prover illustrated by these theorems, and how we might expect our system to aid users in making appropriate interventions in proof attempts.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evaluation of a Semi-Automated Theorem Prover (Part II)

This report describes a pilot study of the Barnacle interface to the Clam automated theorem prover. The intent is to gather information about the usability of Barnacle for inductive theorem proving. This information is intended to guide further development of the Barnacle interface to Clam. The focus is on the utility of Barnacle in allowing users to spot toiling proofs and to intervene to rect...

متن کامل

XBarnacle: Making Theorem Provers More Accessible

XBarnacle was built to meet the challenge of incorporating interactive features in the automated theorem prover CLAM whilst preserving the advantages of automation. Many people are not able to use theorem provers to their full strength. The aim of our research is to make semi-automated theorem proving a real possibility for a wide range of people – from those primarily interested in formal spec...

متن کامل

Agda as a platform for the development of verified railway interlocking systems

This thesis identifies a technological framework that aids the development of verified railway interlocking systems in the Agda theorem prover. The thesis is in two parts, Part I deals with integrating interactive and automated theorem proving in type theory, and Part II addresses verification in the

متن کامل

A single axiom for semi-Boolean SQS-skeins

In this note, we show that the variety of semi-Boolean SQS-skeins can be defined by a single axiom and exhibit a single axiom for said variety that was found with the aid of the automated theorem-prover Prover9.

متن کامل

Analysis and transformation of proof procedures

Automated theorem proving has made great progress during the last few decades. Proofs of more and more diicult theorems are being found faster and faster. However, the exponential increase in the size of the search space remains for many theorem proving problems. Logic program analysis and transformation techniques have also made progress during the last few years and automated theorem proving ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007